Queueing-model based analysis of assembly lines with finite buffers and general service times
نویسنده
چکیده
In this paper, we study the production process on multi-stage assembly lines. These production systems comprise simple processing as well as assembly stations. At the latter, workpieces from two or more input stations have to be merged to form a new one for further processing. As the flow of material is asynchronous with stochastic processing times at each station, queueing effects arise as long as buffers provide waiting room. We consider finite buffer capacities and generally distributed processing times. Processing is a service operation to customer items in the sense of a queueing system. The arrival stream of customer items is generated by processing parts at a predecessor station. This paper describes an approximation procedure for determining the throughput of such an assembly line. Exact solutions are not available in this case. For performance evaluation, a decomposition approach is used. The two-station subsystems are analyzed by G/G/1/N stopped-arrival queueing models. In this heuristic approach, the virtual arrival and service rates, and the squared coefficients of variation of these subsystems are determined. A system of decomposition equations which are solved iteratively is presented. Any solution to this system of equations indicates estimated values for the subsystems’ unknown parameters. The quality of the presented approximation procedure is tested against the results of various simulation experiments. Scope and purpose: We consider assembly lines, i.e. flow production systems with a convergent flow of material and synchronization constraints. By considering assembly operations, our paper generalizes the work of Buzacott, Liu and Shanthikumar [Multistage flow line analysis with the stopped arrival queue model. IIE Transactions 1995;27:444–55], in which flow lines as series production systems are analyzed. It also extends the work of Helber [Performance analysis of flow lines with non-linear flow of material, Lecture notes in economics and mathematical systems, vol. 473, Berlin, Heidelberg, New York: Springer; 1999] and Jeong and Kim [Performance analysis of assembly/disassembly systems with unreliable machines and random processing times. IIE Transactions 1998; 30(1):41–53], who analyze assembly systems, by considering general service times. Station failures can be incorporated with the completion time concept proposed by Gaver [A waiting line with interrupted service, including priorities. Journal of the Royal Statistical Society 1962;24(2):73–90. [47]]. The comparison to various simulation results shows that the queueing-model based approach presented in this paper yields quite good approximations of the throughput. 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملApproximate Analysis of Tandem Blocking Queueing Networks with Correlated Arrivals and Services
Many real systems such as production lines are modeled as queueing networks with finite buffers. In such a queueing model, blocking occurs if a customer attempts to enter the next queue whose buffer is full and not available. In this case, the customer is forced to wait until the next queue can be entered. General queueing networks with blocking do not have a product-form solution. Therefore, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & OR
دوره 35 شماره
صفحات -
تاریخ انتشار 2008